Bottom-Up Earley Deduction
نویسنده
چکیده
We propose a bottom-up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incrementai processing (even for head-driven grammars), it is data-driven, no subsumption check is needed, and preference values attached to lexical items can be used to guide best-first search. We discuss the scanning step for bottom-up Earley deduction and indexing schemes that help avoid useless deduction steps.
منابع مشابه
Earley Deduction
This paper first reviews Earley Deduction, a generalization of the Earley Parsing Algorithm to the execution of Horn Clause Logic Programs. Earley Deduction is both sound and—unlike the standard Prolog interpreter—complete; proofs of this are included. For functor-free programs, the method is also guaranteed to terminate. (The functor-free subset of Prolog is called DATALOG and can be used to c...
متن کاملMemoization of Top Down Parsing
In a paper published in this journal, Norvig (1991) pointed out that memoization of a topdown recognizer program produces a program that behaves similiarly to a chart parser. This is not surprising to anyone familiar with logic-programming approaches to NLP. For example, the Earley deduction proof procedure is essentially a memoizing version of the top-down SLD proof procedure employed by Prolo...
متن کاملGeneralized Earley Deduction and Its Correctness
This paper describes a deduction method that works both top-down and bottom-up. The method can be viewed as an extension of a well-known approach|Earley deduction|to handle negation-as-failure. We show that with respect to the stratiied model theory of 1] the method is sound, that it is strongly complete (terminating) for function-free programs with negation, and complete for programs without n...
متن کاملA Framework for Bottom-Up Simulation of SLD-Resolution
This paper introduces a framework for the bottom-up simulation of SLD-resolution based on partial evaluation. The main idea is to use database facts to represent a set of SLD goals. For deductive databases it is natural to assume that the rules defining derived predicates are known at “compile time”, whereas the database predicates are known only later at runtime. The framework is inspired by t...
متن کاملA Semantic-Head-Driven Generation Algorithm for Uni cation-Based Formalisms
We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semantically nonmonotonic grammars, yet unlike top-down methods, it also permits left-recursion. The enablin...
متن کامل